Domination Criticality
نویسندگان
چکیده
For many graphs parameters, criticality is a fundamental issue. For domination number, Brigham, Chinn, and Dutton began the study of graphs where the domination number decreases on the removal of any vertex. Brigham, Haynes, Henning, and Rall defined the term (γ, k)-critical and proved results for graphs that are (γ, 2)-critical or bicritical. A graph G is said to be (γ, k)-critical if γ(G − S) < γ(G) for any set of k vertices and domination number γ. I will survey the results of the Brigham, et. al. paper and show how many of these results may be extended to the case of a general k. The generalizations are mentioned in a recently submitted paper.
منابع مشابه
Domination in Circulant Graphs
A graph G with no isolated vertex is total domination vertex critical if for any vertex v of G that is not adjacent to a vertex of degree one, the total domination number of G− v is less than the total domination number of G. We call these graphs γt-critical. In this paper, we determine the domination and the total domination number in the Circulant graphs Cn〈1, 3〉, and then study γ-criticality...
متن کاملCritical properties on Roman domination graphs
A Roman domination function on a graph G is a function r : V (G) → {0, 1, 2} satisfying the condition that every vertex u for which f(u) = 0 is adjacent to at least one vertex v for which f(v) = 2. The weight of a Roman function is the value r(V (G)) = ∑ u∈V (G) r(u). The Roman domination number γR(G) of G is the minimum weight of a Roman domination function on G . "Roman Criticality" has been ...
متن کاملMatching properties in connected domination critical graphs
A dominating set of vertices S of a graph G is connected if the subgraph G[S] is connected. Let c(G) denote the size of any smallest connected dominating set in G. A graph G is k-connected-critical if c(G)= k, but if any edge e ∈ E(Ḡ) is added to G, then c(G+ e) k − 1. This is a variation on the earlier concept of criticality of edge addition with respect to ordinary domination where a graph G ...
متن کاملCritical concept for 2-rainbow domination in graphs
For a graph G, let f : V (G) → P({1, 2, . . . , k}) be a function. If for each vertex v ∈ V (G) such that f(v) = ∅ we have ∪u∈N(v)f(u) = {1, 2, . . . , k}, then f is called a k-rainbow dominating function (or simply kRDF) of G. The weight, w(f), of a kRDF f is defined as w(f) = ∑ v∈V (G) |f(v)|. The minimum weight of a kRDF of G is called the k-rainbow domination number of G, and is denoted by ...
متن کاملEdge Criticality in Graph Domination
A vertex subset D ⊆ V of a graph G = (V, E) is a dominating set of G if each vertex of G is a member of D or is adjacent to a member of D. The cardinality of a smallest dominating set of G is called the domination number of G and a nonempty graph G is q-critical if q is the smallest number of arbitrary edges of G whose removal fromG necessarily increases the domination number of the resulting g...
متن کامل